On the definition of stochastic λ-transducers1
نویسندگان
چکیده
We propose a formal definition for the general notion of stochastic transducer, called stochastic λ-transducer. Our definition is designed with two objectives in mind: (i) to extend naturally the established notion of stochastic automaton with output – as defined in the classic books of Paz (1971) and Starke (1972) – by permitting pairs of input-output words of different lengths; (ii) to be compatible with the more general notion of weighted transducer so that one can apply tools of weighted transducers to address certain computational problems involving stochastic transducers. The new transducers can be used to model stochastic input-output processes that cannot be modeled using classic stochastic automata with output.
منابع مشابه
Karlin’s Basic Composition Theorems and Stochastic Orderings
Suppose λ,x,ζ traverse the ordered sets Λ, X and Z, respectively and consider the functions f(λ,x,ζ) and g(λ,ζ) satisfying the following conditions, (a) f(λ,x,ζ) > 0 and f is TP2 in each pairs of variables when the third variable is held fixed and (b) g(λ,ζ) is TP2. Then the function h(λ,x) =∫Z f(λ,x,ζ)g(λ,ζ)dµ(ζ), defined on Λ×X is TP2 in (λ,x). The aim of this note is to use a new stochast...
متن کاملOn generalized fuzzy numbers
This paper first improves Chen and Hsieh’s definition of generalized fuzzy numbers, which makes it the generalization of definition of fuzzy numbers. Secondly, in terms of the generalized fuzzy numbers set, we introduce two different kinds of orders and arithmetic operations and metrics based on the λ-cutting sets or generalized λ-cutting sets, so that the generalized fuzzy numbers are integrat...
متن کاملOn the definition of stochastic λ – transducers
We propose a formal definition for the general notion of stochastic transducer, called stochastic λ-transducer. Our definition is designed with two objectives in mind: (i) to extend naturally the established notion of stochastic automaton with output – as defined in the classic books of Paz (1971) and Starke (1972) – by permitting pairs of input-output words of different lengths; (ii) to be com...
متن کاملMath 564 : Applied Stochastic Processes ( Fall 2017 ) Lecture : 10 Invariant Distributions
Suppose C is a closed recurrent communicating class for a Markov chain, if we restrict the chain on this class, the result is still a Markov chain with state space C. The resulting Markov chain is irreducible and recurrent. In this lecture, we will focus on the long-time behavior of irreducible and recurrent Markov chain. First, we have the following related definition. Definition 10.1. For a M...
متن کاملStochastic Processes ( Fall 2017 ) Lecture : 10 Invariant Distributions
Suppose C is a closed recurrent communicating class for a Markov chain, if we restrict the chain on this class, the result is still a Markov chain with state space C. The resulting Markov chain is irreducible and recurrent. In this lecture, we will focus on the long-time behavior of irreducible and recurrent Markov chain. First, we have the following related definition. Definition 10.1. For a M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006